Enhanced Cluster Computing Performance Through Proportional Fairness

The performance of cluster computing depends on how concurrent jobs share multiple data center resource types like CPU, RAM and disk storage. Recent research has discussed efficiency and fairness requirements and identified a number of desirable scheduling objectives including so-called dominant resource fairness (DRF). We argue here that proportional fairness (PF), long recognized as a desirable objective in sharing network bandwidth between ongoing flows, is preferable to DRF. The superiority of PF is manifest under the realistic modelling assumption that the population of jobs in progress is a stochastic process. In random traffic the strategy-proof property of DRF proves unimportant while PF is shown by analysis and simulation to offer a significantly better efficiency-fairness tradeoff.Comment: Submitted to Performance 201

Multi-resource fairness: Objectives, algorithms and performance

Designing efficient and fair algorithms for sharing multiple resources between heterogeneous demands is becoming increasingly important. Applications include compute clusters shared by multi-task jobs and routers equipped with middleboxes shared by flows of different types. We show that the currently preferred objective of Dominant Resource Fairness has a significantly less favorable efficiency-fairness tradeoff than alternatives like Proportional Fairness and our proposal, Bottleneck Max Fairness. In addition to other desirable properties, these objectives are equally strategyproof in any realistic scenario with dynamic demand

Microbial Foodborne Disease: Hospitalizations, Medical Costs and Potential Demand for Safer Food

Food Consumption/Nutrition/Food Safety, Health Economics and Policy,

Emergence of novel magnetic order at finite temperature in overdoped pnictides

We examine the temperature dependence of the magnetic ordering in the frustrated Heisenberg $J_1-J_2$ model in presence of two different kind of dopants: vacancies or magnetic impurities. We demonstrate that, irrespective to their magnetic ratio, the introduction of impurities quenches the order by disorder selection mechanism associated with an Ising-like phase transition at low temperatures and gives way to a $90^\circ$ (anticollinear) order . The presence of dopants triggers a non trivial competition between entropically selected states (collinear) and energetically favoured ones (anticollinear) in dependence of both dilution and temperature. While in case of magnetic impurity, the interesting magnetic phases are observed for full range of temperature and doping, in case of nonmagnetic impurities every magnetic order is destroyed at all temperatures above $12\%$ dilution. At fixed low temperature and tuning the doping we show a first order phase transition leading to the re-entrance of the Ising-like order with percolation of islands of $90^\circ$ order. At fixed doping and varying the temperature we observe a transition from the anticollinear to the collinear phase assisted by a new emerging magnetic phase in the presence of magnetic impurities, whilst in case of vacancies this transition is characterised by a coexistent region of both. Furthermore, tuning the magnetic moment of the impurities, a complete collapse of the Ising-like order is attained. This is in agreement with observations of Ir dopant atoms in superconducting Ba(Fe$_{1-x}$Ir$_x$)$_2$As$_2$ with $x<0.047$

Maximal antichains of minimum size

Let $n\geqslant 4$ be a natural number, and let $K$ be a set $K\subseteq [n]:={1,2,...,n}$. We study the problem to find the smallest possible size of a maximal family $\mathcal{A}$ of subsets of $[n]$ such that $\mathcal{A}$ contains only sets whose size is in $K$, and $A\not\subseteq B$ for all ${A,B}\subseteq\mathcal{A}$, i.e. $\mathcal{A}$ is an antichain. We present a general construction of such antichains for sets $K$ containing 2, but not 1. If $3\in K$ our construction asymptotically yields the smallest possible size of such a family, up to an $o(n^2)$ error. We conjecture our construction to be asymptotically optimal also for $3\not\in K$, and we prove a weaker bound for the case $K={2,4}$. Our asymptotic results are straightforward applications of the graph removal lemma to an equivalent reformulation of the problem in extremal graph theory which is interesting in its own right.Comment: fixed faulty argument in Section 2, added reference

Implementation of rigorous renormalization group method for ground space and low-energy states of local Hamiltonians

The practical success of polynomial-time tensor network methods for computing ground states of certain quantum local Hamiltonians has recently been given a sound theoretical basis by Arad, Landau, Vazirani, and Vidick. The convergence proof, however, relies on "rigorous renormalization group" (RRG) techniques which differ fundamentally from existing algorithms. We introduce an efficient implementation of the theoretical RRG procedure which finds MPS ansatz approximations to the ground spaces and low-lying excited spectra of local Hamiltonians in situations of practical interest. In contrast to other schemes, RRG does not utilize variational methods on tensor networks. Rather, it operates on subsets of the system Hilbert space by constructing approximations to the global ground space in a tree-like manner. We evaluate the algorithm numerically, finding similar performance to DMRG in the case of a gapped nondegenerate Hamiltonian. Even in challenging situations of criticality, or large ground-state degeneracy, or long-range entanglement, RRG remains able to identify candidate states having large overlap with ground and low-energy eigenstates, outperforming DMRG in some cases.Comment: 13 pages, 10 figure

Sensitivity of Pagurus bernhardus (L.) to substrate-borne vibration and anthropogenic noise

© 2015 Elsevier B.V. Despite the prevalence of vibration produced by anthropogenic activities impacting the seabed there are few data and little information as to whether these are detected by crustaceans and whether they interfere with their behaviour. Here the sensitivity of unconditioned Pagurus bernhardus to substrate-borne vibration was quantified by exposure to sinusoidal vibrations of 5-410Hz of varied amplitudes using the staircase method of threshold determination, with threshold representing the detection of the response and two behavioural responses used as reception indicators: movement of the second antenna and onset or cessation of locomotion. Thresholds were compared to measured vibrations close to anthropogenic operations and to the time in captivity prior to tests. Behaviour varied according to the strength of the stimulus with a significant difference in average threshold values between the two behavioural indicators, although there was an overlap between the two, with overall sensitivity ranging from 0.09-0.44ms -2 (root mean squared, RMS). Crabs of shortest duration in captivity prior to tests had significantly greater sensitivity to vibration, down to 0.02ms -2 (RMS). The sensitivity of P. bernhardus fell well within the range of vibrations measured near anthropogenic operations. The data indicate that anthropogenic substrate-borne vibrations have a clear effect on the behaviour of a common marine crustacean. The study emphasises that these vibrations are an important component of noise pollution that requires further attention to understand the long term effects on marine crustaceans